#include <iostream>
using namespace std;

const int N = 1010;
int a[N];
int f[N], g[N];

int main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    int res = 0, cnt = 0;
    for (int i = 1; i <= n; i++)
    {
        f[i] = 1;
        for (int j = 1; j < i; j++)
            if (a[j] >= a[i])
                f[i] = max(f[i], f[j] + 1);
        res = max(res, f[i]);

        int k = 0;
        while (k < cnt && g[k] < a[i])   k++;
        g[k] = a[i];
        if (k >= cnt) cnt++;
    }

    cout << res << endl;
    cout << cnt << endl;
    return 0;
}